Faithful Euclidean Distance Field From Log-Gaussian Process Implicit Surfaces

نویسندگان

چکیده

In this letter, we introduce the Log-Gaussian Process Implicit Surface (Log-GPIS), a novel continuous and probabilistic mapping representation suitable for surface reconstruction local navigation. Our key contribution is realisation that regularised Eikonal equation can be simply solved by applying logarithmic transformation to GPIS formulation recover accurate Euclidean distance field (EDF) and, at same time, implicit surface. To derive proposed representation, Varadhan's formula exploited approximate non-linear partial differential (PDE) of EDF logarithm linear PDE. We show members Matérn covariance family directly satisfy The approach does not require post-processing steps EDF. Moreover, unlike sampling-based methods, Log-GPIS use sample points inside outside as derivative allow direct estimation normals gradients. benchmarked method on simulated real data against state-of-the-art frameworks also aim recovering both field. experiments produces most results comparable its computation time still allows online operations.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Gaussian Process Implicit Surfaces

Many applications in computer vision and computer graphics require the definition of curves and surfaces. Implicit surfaces [7] are a popular choice for this because they are smooth, can be appropriately constrained by known geometry, and require no special treatment for topology changes. Given a scalar function f : Rd 7→ R, one can define a manifold S of dimension d− 1 wherever f(x) passes thr...

متن کامل

Laser-Radar Data Fusion with Gaussian Process Implicit Surfaces

This work considers the problem of building high-fidelity 3D representations of the environment from sensor data acquired by mobile robots. Multi-sensor data fusion allows for more complete and accurate representations, and for more reliable perception, especially when different sensing modalities are used. In this paper, we propose a thorough experimental analysis of the performance of 3D surf...

متن کامل

Gaussian Faithful Markov Trees

We study two types of graphical models in this paper: concentration and covariance graphical models. Graphical models use graphs to encode or capture the multivariate dependencies that are present in a given multivariate distribution. A concentration graph associated with a multivariate probability distribution of a given random vector is an undirected graph where each vertex represents each of...

متن کامل

Euclidean Distance Reconstruction from Partial Distance Information

Euclidean distance matrix completion problem aims at reconstructing the low dimensional geometry structure of nodes given only a few pairwise distances between nodes [1]. This problem arises in many applications including networks and machine learning where much information of points is laking. For instance, in sensor networks, due to the constraints of energy and communication radius, sensor n...

متن کامل

Euclidean Distance between Haar Orthogonal and Gaussian Matrices

In this work we study a version of the general question of how well a Haar distributed orthogonal matrix can be approximated by a random gaussian matrix. Here, we consider a gaussian random matrix Yn of order n and apply to it the Gram-Schmidt orthonormalization procedure by columns to obtain a Haar distributed orthogonal matrix Un. If F m i denotes the vector formed by the first m-coordinates ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: IEEE robotics and automation letters

سال: 2021

ISSN: ['2377-3766']

DOI: https://doi.org/10.1109/lra.2021.3061356